A subdivision-based algorithm for the sparse resultant
نویسندگان
چکیده
منابع مشابه
An E cient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be de ned as the GCD of n + 1 such d...
متن کاملAn Efficient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be deened as the GCD of n + 1 such d...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA perturbed differential resultant based implicitization algorithm for linear DPPEs
Let K be an ordinary differential field with derivation ∂. Let P be a system of n linear differential polynomial parametric equations in n− 1 differential parameters with implicit ideal ID. Given a nonzero linear differential polynomial A in ID we give necessary and sufficient conditions on A for P to be n − 1 dimensional. We prove the existence of a linear perturbation Pφ of P so that the line...
متن کاملA Practical Method for the Sparse Resultant ( Extended
We propose an eecient method for computing the sparse resultant of a system of n + 1 polynomial equations in n unknowns. Our approach improves upon CE93] and constructs a smaller matrix whose determinant is a non-zero multiple of the resultant and from which the latter is easily recovered. For certain classes of systems, it attains optimality by expressing the resultant as a single determinant....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2000
ISSN: 0004-5411,1557-735X
DOI: 10.1145/337244.337247